package leetcode.Leetcode1;

import java.util.HashMap;
import java.util.Map;

class Solution {
    public int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            int tmp=target-nums[i];
            for (int j = i+1; j <nums.length ; j++) {
                if (nums[j]==tmp){
                    return new int[]{i,j};
                }

            }
        }
        return new int[]{};
    }

    public int[] twoSum1(int[] nums, int target) {
        Map<Integer,Integer> map=new HashMap<Integer,Integer>();
        for(int i=0;i<nums.length;i++){
            if (map.containsKey(target-nums[i])){
                return new int[]{map.get(target-nums[i]),i};
            }
            map.put(nums[i],i);
        }
        return new int[]{};
    }
}
